Neural Networks for Np-complete Problems
نویسنده
چکیده
combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound mathematical foundation and that, beside their theoretical interest, are also numerically encouraging. These algorithms easily deal with problems with thousands of instances taking Neural Network approaches out of the "toy-problem" era.
منابع مشابه
Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems
USING NEURAL NETWORKS AND GENETIC ALGORITHMS AS HEURISTICS FOR NP-COMPLETE PROBLEMS William M. Spears, M.S. George Mason University, 1989 Thesis Director: Dr. Kenneth A. De Jong Paradigms for using neural networks (NNs) and genetic algorithms (GAs) to heuristically solve boolean satisfiability (SAT) problems are presented. Results are presented for two-peak and false-peak SAT problems. Since SA...
متن کاملEmergence of Learning: An Approach to Coping with NP-Complete Problems in Learning
Various theoretical results show that learning in conventional feedforward neural networks such as multilayer perceptrons is NP-complete. In this paper we show that learning in min-max modular (M3) neural networks is tractable. The key to coping with NP-complete problems in M3 networks is to decompose a large-scale problem into a number of manageable, independent subproblems and to make the lea...
متن کاملAn introduction to artificial neural networks
Artificial neural networks are algorithms which have been developed to tackle a range of computational problems. These range from modelling brain function to making predictions of time-dependent phenomena to solving hard (NP-complete) problems. In this introduction we describe a single, yet very important, type of network known as a feedforward network. This network is a mathematical model whic...
متن کاملThe Neural Network Loading Problem Is Undecidable
There exist several well known results concerning the computational complexity of training, design, etc. of (artiicial) neural networks which demonstrated that these problems are at least NP complete. Extending these results we will prove here that the training of neural networks, i.e. the so called \loading problem", in general, is even \unsolvable". This implies in particular that there exist...
متن کاملSatellite Frequency Assignments Using Transiently Chaotic Neural Networks with Variable Thresholds
The objective of the satellite frequency assignment problem (FAP) is to minimize the cochannel interference between two satellite systems by rearranging the frequency assignments. This NP-complete problem is difficult to solve, especially for large-size problems, and is yet growing in importance, since we increasingly depend on satellites to fulfill our communications needs. In this paper, we p...
متن کامل